Some relations between distance-based polynomials of trees
نویسندگان
چکیده
منابع مشابه
Some relations between Kekule structure and Morgan-Voyce polynomials
In this paper, Kekule structures of benzenoid chains are considered. It has been shown that the coefficients of a B_n (x) Morgan-Voyce polynomial equal to the number of k-matchings (m(G,k)) of a path graph which has N=2n+1 points. Furtermore, two relations are obtained between regularly zig-zag nonbranched catacondensed benzenid chains and Morgan-Voyce polynomials and between regularly zig-zag ...
متن کاملRelations between Zagreb Coindices and Some Distance–Based Topological Indices∗
For a nontrivial graph G, its first Zagreb coindex is defined as the sum of degree sum over all non-adjacent vertex pairs in G and the second Zagreb coindex is defined as the sum of degree product over all non-adjacent vertex pairs in G. Till now, established results concerning Zagreb coindices are mainly related to composite graphs and extremal values of some special graphs. The existing liter...
متن کاملDistance Matrix Polynomials of Trees
Let G be a finite connected graph. If x and y are vertices of G, one may define a distance function d, on G by letting d&x, y) be the minimal length of any path between x and y in G (with d&, x) = 0). Thus, for example, d&x, y) = 1 if and only if {x, y} is an edge of G. Furthermore, we define the distance matrix D(G) for G to be the square matrix with rows and columns indexed by the vertex set ...
متن کاملRelations between Renyi Distance and Fisher Information
In this paper, we first show that Renyi distance between any member of a parametric family and its perturbations, is proportional to its Fisher information. We, then, prove some relations between the Renyi distance of two distributions and the Fisher information of their exponentially twisted family of densities. Finally, we show that the partial ordering of families induced by Renyi dis...
متن کاملOn some relations between 2-trees and tree metrics
A tree function (TF) t on a nite set X is a real function on the set of the pairs of elements of X satisfying the four-point condition: for all distinct x; y; z; w∈X; t(xy)+ t(zw)6max{t(xz)+ t(yw); t(xw) + t(yz)}. Equivalently, t is representable by the lengths of the paths between the leaves of a valued tree Tl. TFs are a straightforward generalization of the tree dissimilarities and tree metr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin: Classe des sciences mathematiques et natturalles
سال: 2005
ISSN: 0561-7332
DOI: 10.2298/bmat0530001g